The convexity of induced paths of order three

نویسندگان

  • Rafael T. Araújo
  • Rudini Menezes Sampaio
  • Jayme Luiz Szwarcfiter
چکیده

In this paper, we introduce a new convexity on graphs similar to the well known P3convexity [3], which we will call P ∗ 3 -convexity. We show that several P ∗ 3 -convexity parameters (hull number, convexity number, Carathéodory number, Radon number, interval number and percolation time) are NP-hard even on bipartite graphs. We show a strong relation between this convexity and the well known geodesic convexity [11], which implies several NP-hardness results on the geodesic convexity. We also obtain linear time algorithms to determine all those parameters on the above mentioned convexities for some graph classes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L-FUZZY CONVEXITY INDUCED BY L-CONVEX FUZZY SUBLATTICE DEGREE

In this paper, the notion of $L$-convex fuzzy sublattices is introduced and their characterizations are given. Furthermore,  the notion of the degree to which an $L$-subset is an $L$-convex fuzzy sublattice is proposed and its some  characterizations are given. Besides, the $L$-convex fuzzy sublattice degrees of the homomorphic image and pre-image of an $L$-subset are studied. Finally, we obtai...

متن کامل

On monophonic sets in graphs1

Classical convexity can be naturally translated to graphs considering shortest paths, giving rise to the geodesic convexity. Moreover, if we consider induced paths between vertices, we get the so-called monophonic convexity. In this work, we present some results involving monophonic sets.

متن کامل

Convex Partitions of Graphs induced by Paths of Order Three

In [4] Bollobás considers “The spread of an infection on a square grid”. Initially some squares of a square grid are infected. The infection spreads to an uninfected square if at least two of the neighbouring squares are infected. A natural combinatorial problem — solved using an elegant perimeter argument in [4] — is to determine the minimum number of initially infected squares such that event...

متن کامل

The starlikeness, convexity, covering theorem and extreme points of p-harmonic mappings

The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.

متن کامل

A general framework for path convexities

In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity ; and there are many other examples. Besides reviewing the path convexities in the literature, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2013